From discrete to continuous Wardrop equilibria

The notion of Wardrop equilibrium in congested networks has been very popular in congested traffic modelling since its introduction in the early 50’s, it is also well-known that Wardrop equilibria may be obtained by some convex minimization problem. In this paper, in the framework of Γ-convergence theory, we analyze what happens when a cartesian network becomes very dense. The continuous model we obtain this way is very similar to the continuous model of optimal transport with congestion of Carlier, Jimenez and Santambrogio [6] except that it keeps track of the anisotropy of the network.